A fast natural algorithm for searching*1

A fast natural algorithm for searching

In this note we present two natural algorithms—one for sorting, and another for searching a sorted list of items. Both algorithms work in O( √ N ) time, N being the size of the list. A combination of these algorithms can search an unsorted list in O( √ N ) time, an impossibility for classical algorithms. The same complexity is achieved by Grover’s quantum search algorithm; in contrast to Grover...

A New Fast Data Encryption Algorithm (FDE)

A New Fast Data Encryption Algorithm (FDE)

A Fast Natural Algorithm for Searching: Preliminary version

In this note we present two natural algorithms—one for sorting and another for searching a sorted list of items. Both algorithms work in O( √ N) time, N being the size of the list. A combination of these algorithms can search an unsorted list in O( √ N) time, an impossibility for classical algorithms. The same complexity is achieved by Grover’s quantum search algorithm; in contrast to Grover’s ...

A Fast Algorithm for Covering Rectangular Orthogonal Polygons with a Minimum Number of r-Stars

Introduction This paper presents an algorithm for covering orthogonal polygons with minimal number of guards. This idea examines the minimum number of guards for orthogonal simple polygons (without holes) for all scenarios and can also find a rectangular area for each guards. We consider the problem of covering orthogonal polygons with a minimum number of r-stars. In each orthogonal polygon P,...